On an extremal plane graph
نویسندگان
چکیده
منابع مشابه
Notes on Extremal Graph Theory
What you see below are notes related to a course that I have given several times in Extremal Graph Theory. I guarantee no accuracy with respect to these notes and I certainly do not guarantee completeness or proper attribution. This is an early draft and, with any luck and copious funding, some of this can be made into a publishable work and some will just remain as notes. Please do not distrib...
متن کاملOn the spectrum of an extremal graph with four eigenvalues
In this note we study some properties of the spectrum of a connected graph G with four different eigenvalues, and (spectrally maximum) diameter three. When G is regular, this is the case, for instance, when G is a distance-regular graph. © 2006 Elsevier B.V. All rights reserved.
متن کاملAn Extremal Problem in Graph Theory
G(?z; I) will denote a graph of n vertices and 1 edges. Let fO(lz, K) be the smallest integer such that there is a G (n; f,, (n, k)) in which for every set of K vertices there is a vertex joined to each of these. Thus for example fO(3, 2) = 3 since in a triangle each pair of vertices is joined to a third. It can readily be checked that f,(4, 2) = 5 (the extremal graph consists of a complete 4-g...
متن کاملAn extremal graph with given bandwidth
The graph bandwidth problem is a well-known NP-complete problem. The relation between size of a graph and bandwidth is very interesting. The minimum size required in G with bandwidth B is denoted as m(n, B) while the graph G of order n and bandwidth B with size m(n, B) is called an extremal graph. This paper provides the minimum size for a graph of odd order n, n ≥ 9, and bandwidth (n + 1)/2, a...
متن کاملOn Extremal Properties of Graph Entropies
Institute for Bioinformatics and Translational Research, UMIT, Eduard Wallnoefer Zentrum 1, 6060 Hall in Tyrol, Austria Email: {matthias.dehmer, veronika.kraus}@umit.at (Received May 2, 2012) Abstract We study extremal properties of graph entropies based on so-called information functionals. We obtain some extremality results for the resulting graph entropies which rely on the well-known Shanno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1956
ISSN: 0528-2195
DOI: 10.21136/cpm.1956.117227